Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
نویسندگان
چکیده
multi-agent project scheduling problem Cyril Briand , Sandra Ulrich Ngueveu and Přemysl Š̊ucha (1) CNRS ; LAAS ; 7 avenue du colonel Roche, F-31077 Toulouse Cedex 4, France, (2) Université de Toulouse ; UPS, INP; LAAS; F-31077 Toulouse Cedex 4, France (3) Czech Technical University in Prague; Faculty of Electrical Engineering; Karlovo namesti 13, 121 35, Prague 2, Czech Republic Emails: {briand, ngueveu}@laas.fr [email protected]
منابع مشابه
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملNash equilibria for the multi-agent project scheduling problem with controllable processing times
This paper considers a project scheduling environment in which the activities of the project network are partitioned among a set of agents. Activity durations are controllable, i.e., every agent is allowed to shorten the duration of its activities, incurring a crashing cost. If the project makespan is reduced with respect to its normal value, a reward is offered to the agents and each agent rec...
متن کاملAn Evolutionary Algorithm Based on a Hybrid Multi-Attribute Decision Making Method for the Multi-Mode Multi-Skilled Resource-constrained Project Scheduling Problem
This paper addresses the multi-mode multi-skilled resource-constrained project scheduling problem. Activities of real world projects often require more than one skill to be accomplished. Besides, in many real-world situations, the resources are multi-skilled workforces. In presence of multi-skilled resources, it is required to determine the combination of workforces assigned to each activity. H...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Scheduling
دوره 20 شماره
صفحات -
تاریخ انتشار 2017